منابع مشابه
On Sums Over Partially Ordered Sets
We establish a general theorem for reducing sums of type ∑ y≥x g(y) where g is a mapping from a partially ordered set into an abelian group. Conclusions concern the Möbius function, the principle of inclusionexclusion, the Tutte polynomial and Crapo’s beta invariant.
متن کاملTripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملBoolean algebras over partially ordered sets
Being the crossroads between Algebra, Topology, Logic, Set Theory and the Theory of Order; the class of Boolean algebras over partially ordered sets were look at as one of the sources, providing over time, new insights in Boolean algebras. Some constructions and their interconnections will be discussed, motivating along the way a list of open problems. Mathematics Subject Classification (MSC 20...
متن کاملPartially Ordered Sets
For example, thus far, I had the fortune to work intimately with nine (9) undergraduate students on research questions in the areas of computational algebra and algebraic geometry. I am directing two master’s students in their research for their theses at Sam Houston State University. All of these undergraduate students have enrolled in graduate programs around the country. Three have finished ...
متن کاملSums of lexicographically ordered sets
We consider the problem of determining finite integer sets which are knapsack-solvable in linear time (that is, it is possible to determine in linear time, for any integer b, whether b can be expressed as a sum of distinct elements of that set) and where the largest element is as small as possible. We study the condition that the k-subsets (for fixed k) when lexicographically ordered have incre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1999
ISSN: 1077-8926
DOI: 10.37236/1466